Inverse transforms of products of Legendre transforms
نویسندگان
چکیده
منابع مشابه
Inverse Transforms of Products of Legendre Transforms
is obtained by applying successive integration by parts to the integral represented by the left-hand member of this equation so that the new integrand is the product of F by [(1 —x2)P„' ]', and by replacing this second factor by — n(n + l)Pn according to Legendre's differential equation [l]. Thus certain boundary value problems in ordinary and partial differential equations that involve the dif...
متن کاملApery Sequences and Legendre Transforms
A lower bound for the minimal length of the polynomial recurrence of a binomial sum is obtained. 2000 Mathematics subject classification: primary 11B37. A sequence an satisfies a polynomial recurrence of length r and degree m if there exist r polynomials Po, Pu ... , Pr_u with degree at most m such that (1) Po(n)an + P x { n ) a n ^ + ••• + P r ^ ( n ) a n r = 0 for n > r. For a sequence an the...
متن کاملToeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملOn the Efficient Parallel Computation of Legendre Transforms
In this article, we discuss a parallel implementation of efficient algorithms for computation of Legendre polynomial transforms and other orthogonal polynomial transforms. We develop an approach to the Driscoll–Healy algorithm using polynomial arithmetic and present experimental results on the accuracy, efficiency, and scalability of our implementation. The algorithms were implemented in ANSI C...
متن کاملHierarchical Load Balancing for Parallel Fast Legendre Transforms
We present a parallel Fast Legendre Transform (FLT) based on the Driscol{Healy algorithm with computation complexity O(N log 2 N). The parallel FLT is load{ balanced in a hierarchical fashion. We use a load{balanced FFT to deduce a load{ balanced parallel fast cosine transform, which in turn serves as a building block for the Legendre transform engine, from which the parallel FLT is constructed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1954
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1954-0062872-4